The specialization of the treetraits class for the covertree tree type.
static const bool FirstPointIsCentroid = true
Each cover tree node contains only one point, and that point is its centroid. static const bool HasOverlappingChildren = true
The cover tree (or, this implementation of it) does not require that children represent non-overlapping subsets of the parent node. static const bool HasSelfChildren = true
Cover trees do have self-children. static const bool RearrangesDataset = false
Points are not rearranged when the tree is built.
The specialization of the TreeTraits class for the CoverTree tree type.
It defines characteristics of the cover tree, and is used to help write tree-independent (but still optimized) tree-based algorithms. See mlpack/core/tree/tree_traits.hpp for more information.
Definition at line 40 of file traits.hpp.
Each cover tree node contains only one point, and that point is its centroid.
Definition at line 53 of file traits.hpp.
The cover tree (or, this implementation of it) does not require that children represent non-overlapping subsets of the parent node.
Definition at line 47 of file traits.hpp.
Cover trees do have self-children.
Definition at line 58 of file traits.hpp.
Points are not rearranged when the tree is built.
Definition at line 63 of file traits.hpp.
Generated automatically by Doxygen for MLPACK from the source code.